\documentclass[11pt]{report}
\ifx\pdftexversion\undefined
\usepackage [dvips]{graphicx}
\else
\usepackage[pdftex]{graphics}
\fi
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{amsmath}
\usepackage{palatino}
\usepackage[english]{babel}
%\usepackage{paralist}
%\usepackage{mathdots}

\textwidth = 6.5 in
\textheight = 9 in
\oddsidemargin = 0.0 in
\evensidemargin = 0.0 in
\topmargin = 0.0 in
\headheight = 0.0 in

\headsep = 0.0 in
\parskip = 0.2in
\parindent = 0.0in

\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{corollary}{Corollary}
\newtheorem{claim}{Claim}
\newtheorem{proposition}{Proposition}
\newtheorem{problem}{Problem}
\newtheorem{observation}{Observation}
\newtheorem{question}{Question}
\newtheorem{openproblem}{Open Problem}
\newtheorem{digress}{Digression}
\newtheorem{definition}{Definition}
\newtheorem{fact}{Fact}


\begin{document}
\title{Random Walks on Graphs, Study Notes}
\author{Bangsheng Tang, Youming Qiao}
\date{\today}
\maketitle \tableofcontents

\chapter{Overview}

\input{overview}

\chapter{Mathematical Aspects}

\section{The Model}

\input{model}

\section{The Issue of Convergence}
\input{convergence}

\section{Spectral Method}
\input{spectral}

\section{Expander Graph}
\input{expander}

\section{Random Walk on Directed Graphs}
\input{direct}

\chapter{Applications in Theoretical Computer Science}

\section{Error Reduction}
\input{reduction}

%\section{ST Connectivity Problem}
%\input{st}

%\section{A Proof for PCP Theorem}
%\input{pcp}

%\chapter{Applications in Algorithm Design}
%\input{alg}

\chapter{Conclusion}
\input{conclusion}

\bibliographystyle{abbrv}
\bibliography{ref}
\end{document}
